NP-hard problems

Results: 67



#Item
11Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Spanning tree / Operations research / Combinatorial optimization / NP-hard problems / Online algorithm / Steiner tree problem / Minimum spanning tree / Travelling salesman problem

CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-01 15:15:38
12NP-complete problems / Computational complexity theory / Analysis of algorithms / Operations research / NP-hard problems / Vertex cover / Travelling salesman problem / Dynamic programming / Parameterized complexity / Independent set / Algorithm / 2-satisfiability

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-15 10:47:56
13NP-complete problems / Graph coloring / NP-hard problems / Graph theory / Planar graphs / Treewidth / Graph / Independent set / Tree decomposition / Outerplanar graph / Tree / Graph labeling

Distance Three Labelings of Trees∗ Jiˇr´ı Fiala† Petr A. Golovach‡ Bernard Lidick´

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:05
14NP-hard problems / NP-complete problems / Operations research / Travelling salesman problem / Gadget / Graph

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP∗ Matthias Englert Heiko R¨oglin

Add to Reading List

Source URL: www.dcs.warwick.ac.uk

Language: English - Date: 2008-09-04 11:36:22
15Graph theory / Mathematics / NP-complete problems / NP-hard problems / Graph coloring / Routing algorithms / Search algorithms / Hamiltonian path / Bipartite graph / Travelling salesman problem / A* search algorithm / Planar separator theorem

DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2010-06-13 16:41:26
16Computational complexity theory / Theory of computation / Complexity classes / NP-complete problems / Mathematical optimization / NP-hard problems / MAX-3SAT / NP / Approximation algorithm / Probabilistically checkable proof / PCP theorem / APX

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2008-02-01 14:51:28
17Graph theory / Mathematics / NP-complete problems / NP-hard problems / Operations research / Travelling salesman problem / Matching / Eulerian path / Hamiltonian path / Minimum spanning tree / Cycle / Line graph

Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2014-10-22 08:43:20
18Operations research / Computational complexity theory / Scheduling / Mathematics / Applied mathematics / NP-hard problems / Complexity classes / Mathematical optimization / Flow shop scheduling / Makespan / Combinatorial optimization / Schedule

Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc

Add to Reading List

Source URL: www.ijimai.org

Language: English - Date: 2016-03-29 07:56:34
19Graph theory / Graph coloring / Matching / NP-complete problems / Combinatorial optimization / Graph operations / Blossom algorithm / Bipartite graph / Chordal graph / Complete coloring / Cograph / Ear decomposition

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2014-02-09 09:55:11
20Computational neuroscience / Human-based computation / Complexity classes / CAPTCHA / Computer security / Computer vision / Internet bot / Turing test / Artificial general intelligence / Luis von Ahn / Artificial intelligence / NP

CAPTCHA: Using Hard AI Problems For Security Luis von Ahn1 , Manuel Blum1 , Nicholas J. Hopper1 , and John Langford2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh PA 15213, USA

Add to Reading List

Source URL: hunch.net

Language: English - Date: 2003-09-18 19:47:10
UPDATE